Analysis of systematic scan Metropolis algorithms using Iwahori - Hecke algebra techniques

نویسنده

  • Arun Ram
چکیده

We give the first analysis of a systematic scan version of the Metropolis algorithm. Our examples include generating random elements of a Coxeter group with probability determined by the length function. The analysis is based on interpreting Metropolis walks in terms of the multiplication in the Iwahori-Hecke algebra.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ja n 20 04 Analysis of systematic scan Metropolis algorithms using Iwahori - Hecke algebra techniques

We give the first analysis of a systematic scan version of the Metropolis algorithm. Our examples include generating random elements of a Coxeter group with probability determined by the length function. The analysis is based on interpreting Metropolis walks in terms of the multiplication in the Iwahori-Hecke algebra.

متن کامل

Iwahori-hecke Algebras of Sl2 over 2-dimensional Local Fields

Hecke algebras were first studied because of their role in the representation theory of p-adic groups, or algebraic groups over 1-dimensional local fields. There are two important classes of Hecke algebras. One is spherical Hecke algebras attached to maximal compact open subgroups, and the other is Iwahori-Hecke algebras attached to Iwahori subgroups. A spherical Hecke algebra is isomorphic to ...

متن کامل

James’s Conjecture holds for weight four blocks of Iwahori–Hecke algebras

James’s Conjecture suggests that in certain cases, the decomposition numbers for the Iwahori– Hecke algebra of the symmetric group over a field of prime characteristic (and in particular, the decomposition numbers for the symmetric group itself) coincide with the decomposition numbers for a corresponding Iwahori–Hecke algebra defined over C, and hence can be computed using the LLT algorithm. We...

متن کامل

A Note on Applications of the ‘vector Enumerator’ Algorithm

It is one of the aims of computational representation theory to provide tools for the explicit construction of representations of abstractly given algebras. If the algebra under consideration is given by a finite algebra presentation and the representation searched for is given by a finite module presentation, then the algorithmic tool at hand is the so-called VectorEnumerator algorithm, see Se...

متن کامل

Explicit irreducible representations of the Iwahori – Hecke algebra of Type F

A general method for computing irreducible representations of Weyl groups and Iwahori–Hecke algebras was introduced by the first author in [10]. In that paper the representations of the algebras of typesAn,Bn,Dn andG2 were computed and it is the purpose of this paper to extend these computations to F4. The main goal here is to compute irreducible representations of the Iwahori–Hecke algebra of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000